A problem on random trees
نویسندگان
چکیده
منابع مشابه
Branches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملOn Random Binary Trees
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally . A generating function for the number of nodes given height is developed and used to find the a...
متن کاملOn Random Cartesian Trees
Cartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. lithe search key and the priority key are independent, and the tree is built . based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees . In this article, we analyze the expected behavior when the keys are dependent : in most ...
متن کاملRandom Sequential Adsorption on Random Trees
AIDAN SUDBURY MONASH UNIVERSITY Abstract. When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. Two models which have frequently been studied are the “dimer model” and the “blocking model”, and rather complete solutions for these are known on fixed tree structures or Bethe lattices. In this paper comparisons are mad...
متن کاملRandom Walks on Rooted Trees
For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1971
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90043-8